Method and apparatus for SSIM-based bit allocation

ABSTRACT

A method and an encoder for SSIM-based bits allocation. The encoder includes a memory and a processor utilized for allocating bits based on SSIM, wherein the processor estimates the model parameter of SSIM-based distortion model for the current picture and determines allocates bits based on the SSIM estimation.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims benefit of U.S. provisional patent application Ser. No. 61/540,587, filed Sep. 29, 2011, which are herein incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

Embodiments of the present invention generally relate to a method and apparatus for SSIM-based bit allocation.

2. Description of the Related Art

Bit rate affects the video quality. Thus, it is crucial to allocate the effective amount of bits per frame to maintain quality and efficiency/cost. Mean Square Error is still major metric being used in video encoder control and optimization. However, Mean Square Error based encoder is far from perceptual optimization. Even though SSIM (Structural Similarity) index is a good quality metric for subjective video quality assessment and more correlated than Mean Square Error to a human's visual perception, yet, currently, there is no SSIM-based rate and/or distortion models.

Therefore, there is a need for a method and/or apparatus for SSIM-based bit allocation.

SUMMARY OF THE INVENTION

Embodiments of the present invention relate to a method and an encoder for SSIM-based bits allocation. The encoder includes a memory and a processor utilized for allocating bits based on SSIM, wherein the processor estimates the model parameter of SSIM-based distortion model for the current picture and determines allocates bits based on the SSIM estimation.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.

FIG. 1 is an embodiment of a relationship between ln (D′ssim/Dssim) and Rate;

FIG. 2 is an embodiment of a flow diagram depicting a method for SSIM-based bit allocation; and

FIG. 3 is an embodiment of an encoder.

DETAILED DESCRIPTION

The proposed invention minimizes overall SSIM distortion, which is more correlated with human perceptual quality than MSE, while existing bit allocation methods focus on minimization of overall MSE distortion

The proposed invention provides the optimal number of bits for each coding unit in a closed form. And encoded video by the proposed bit allocation will be more pleasing to human visual system.

SSIM index evaluates the quality of reconstructed coded frame r by comparing luminance, contrast and structural similarities between r and original frame o. That is,

SSIM (o, r) = l(o, r) ⋅ c(o, r) ⋅ s(o, r), where ${{l\left( {o,r} \right)} = \frac{{2\mu_{o}\mu_{r}} + C_{1}}{\mu_{o}^{2} + \mu_{r}^{2} + C_{1}}},{{c\left( {o,r} \right)} = {\frac{{2\sigma_{o}\sigma_{r}} + C_{2}}{\sigma_{o}^{2} + \sigma_{r}^{2} + C_{2}}{and}}}$ ${s\left( {o,r} \right)} = {\frac{{2\sigma_{or}} + C_{3}}{{\sigma_{o}\sigma_{r}} + C_{3}}.}$ C₁, C₂ and C₃ are constants to avoid unstable behavior in the regions of low luminance or low contrast.

The range of SSIM index is 0 to 1. SSIM index is close to 1 when two frames are similar. For example, when two frames are identical, SSIM index is 1. So distortion is 1−SSIM. With MSE as a distortion metric, it is well known that distortion is modeled by D _(MSE)=σ²·exp{−βR), where σ² is variance of residual signal and where β is model parameter.

Residual signal is difference between original and prediction. We observe that distortion in terms of SSIM (i.e. 1−SSIM) is modeled by the similar function. That is, 1−SSIM(o,r)=(1−SSIM(o,p))·exp{−βR), where is model parameter and p is prediction.

By replacing 1−SSIM (o, r) and 1−SSIM (o, p) with D_(ssim) and D′_(ssim), respectively, for simplicity, we have D _(SSIM) =D′ _(SSIM)·exp(−βR), where is model parameter and p is prediction.  (1)

FIG. 1 is an embodiment of a relationship between ln (D′ssim/Dssim) and Rate. FIG. 1 shows the relationship between ln (D′_(SSIM)/D_(SSIM)) and rate for 5 consecutive P frames from 4 720p sequences. Hence, Eq. (1) is valid with different values of β depending on the characteristics of frames (coding units).

Applying the SSIM-based distortion model for perceptually optimized bit allocation and assuming that there are n coding units (e.g. frame) to encode with total bit budge R_(T), the overall perceptual quality is optimized with R_(T). That is,

${{minimize}{\sum\limits_{i = 1}^{N}\;{D_{{SSIM},i}\mspace{14mu}{subject}\mspace{14mu}{to}\mspace{14mu}{\sum\limits_{i = 1}^{N}\; R_{i}}}}} \leq {R_{T}.}$

Here we assume that all coding units are independent. This constrained problem can be converted to the unconstrained problem with Lagrange multiplier:

$\begin{matrix} {{{minimize}{\;\;}J} = {{\sum\limits_{i = 1}^{N}\; D_{{SSIM},i}} + {\lambda \cdot \left( {{\sum\limits_{i = 1}^{N}\; R_{i}} - R_{T}} \right)}}} \\ {= {{\sum\limits_{i = 1}^{N}\;{\beta_{i} \cdot {D^{\prime}}_{{SSIM},i} \cdot {\exp\left( {{- \beta_{i}}R_{i}} \right)}}} + {\lambda \cdot {\left( {{\sum\limits_{i = 1}^{N}\; R_{i}} - R_{T}} \right).}}}} \end{matrix}$ By setting partial derivative w.r.t and λ and R_(k) to 0, we have optimal bits for coding unit k as

$\begin{matrix} {R_{k} = {{\frac{1}{\beta_{k}}{\ln\left( {\beta_{k} \cdot {D^{\prime}}_{{SSIM},k}} \right)}} + {\frac{1}{\beta_{k} \cdot {\sum\limits_{i = 1}^{N}\;\frac{1}{\beta_{i}}}} \cdot {\left\{ {R_{T} - {\sum\limits_{i = 1}^{N}\;{\frac{1}{\beta_{i}}{\ln\left( {\beta_{i} \cdot {D^{\prime}}_{{SSIM},i}} \right)}}}} \right\}.}}}} & (2) \end{matrix}$

The proposed bit allocation in Eq. 2 can be implemented in various ways. For example, two-pass method and approximated one-pass method. In two pass method, all coding units are coded with fixed QP in the first pass to get β and D′_(SSIM) for all coding units in consideration. Then after determining R_(k) for all coding units, they are finally coded in the second pass. In the approximated one-pass method, β and D′_(SSIM) are approximated from previous coding units. In case of frame bit allocation in GOP, β and D′_(SSIM) values of all frames in a GOP can be approximated from frames at the same positions in the previous GOP.

FIG. 2 is an embodiment of a flow diagram depicting a method 2100 for SSIM-based bit allocation. The method 200 starts at step 202 and proceeds to step 204. At step 204, the method 200 set GOP count to zero. At step 206, the method 200 increments the GOP count by 1. At step 208, the method 200 sets the picture count to zero. At step 210, the method 200 encodes the current picture in the current GOP. At step 212, the method 200 estimates the model parameter of SSIM-based distortion model for the current picture. At step 214, the method 200 determines if the current picture is the last picture in the current GOP.

If it is not the last picture in the current GOP, the method 200 proceeds to step 216, wherein the method 200 increments the picture count and returns to step 206; otherwise the method proceeds to step 218. At step 218, the method 200 determines if the current GOP is the last GOP. If it is, the method 200 proceeds to step 222; otherwise, the method 200 proceeds to step 220. At step 220, the method 200 determines the target bits for each frame for the next GOP and returns to step 210. The method 200 ends at step 222.

FIG. 3 shows a block diagram of the largest coding units (LCU) processing portion of an example video encoder. A coding control component (not shown) sequences the various operations of the LCU processing, i.e., the coding control component runs the main control loop for video encoding. The coding control component receives a digital video sequence and performs any processing on the input video sequence that is to be done at the picture level, such as determining the coding type (I, P, or B) of a picture based on the high level coding structure, e.g., IPPP, IBBP, hierarchical-B, and dividing a picture into LCUs for further processing. The coding control component also may determine the initial LCU coding unit (CU) structure for each CU and provides information regarding this initial LCU CU structure to the various components of the video encoder as needed. The coding control component also may determine the initial prediction unit (PU) and transform unit (TU) structure for each CU and provides information regarding this initial structure to the various components of the video encoder as needed.

The LCU processing receives LCUs of the input video sequence from the coding control component and encodes the LCUs under the control of the coding control component to generate the compressed video stream. The CUs in the CU structure of an LCU may be processed by the LCU processing in a depth-first Z-scan order. The LCUs 300 from the coding control unit are provided as one input of a motion estimation component 320, as one input of an intra-prediction component 324, and to a positive input of a combiner 302 (e.g., adder or subtractor or the like). Further, although not specifically shown, the prediction mode of each picture as selected by the coding control component is provided to a mode selector component and the entropy encoder 334.

The storage component 318 provides reference data to the motion estimation component 320 and to the motion compensation component 322. The reference data may include one or more previously encoded and decoded CUs, i.e., reconstructed CUs.

The motion estimation component 320 provides motion data information to the motion compensation component 322 and the entropy encoder 334. More specifically, the motion estimation component 320 performs tests on CUs in an LCU based on multiple inter-prediction modes (e.g., skip mode, merge mode, and normal or direct inter-prediction) and transform block sizes using reference picture data from storage 318 to choose the best motion vector(s)/prediction mode based on a rate distortion coding cost. To perform the tests, the motion estimation component 320 may begin with the CU structure provided by the coding control component. The motion estimation component 320 may divide each CU indicated in the CU structure into PUs according to the unit sizes of prediction modes and into transform units according to the transform block sizes and calculate the coding costs for each prediction mode and transform block size for each CU. The motion estimation component 320 may also compute CU structure for the LCU and PU/TU partitioning structure for a CU of the LCU by itself.

For coding efficiency, the motion estimation component 320 may also decide to alter the CU structure by further partitioning one or more of the CUs in the CU structure. That is, when choosing the best motion vectors/prediction modes, in addition to testing with the initial CU structure, the motion estimation component 320 may also choose to divide the larger CUs in the initial CU structure into smaller CUs (within the limits of the recursive quadtree structure), and calculate coding costs at lower levels in the coding hierarchy. If the motion estimation component 320 changes the initial CU structure, the modified CU structure is communicated to other components that need the information.

The motion estimation component 320 provides the selected motion vector (MV) or vectors and the selected prediction mode for each inter-predicted PU of a CU to the motion compensation component 322 and the selected motion vector (MV), reference picture index (indices), prediction direction (if any) to the entropy encoder 334

The motion compensation component 322 provides motion compensated inter-prediction information to the mode decision component 326 that includes motion compensated inter-predicted PUs, the selected inter-prediction modes for the inter-predicted PUs, and corresponding transform block sizes. The coding costs of the inter-predicted PUs are also provided to the mode decision component 326.

The intra-prediction component 324 provides intra-prediction information to the mode decision component 326 that includes intra-predicted PUs and the corresponding intra-prediction modes. That is, the intra-prediction component 324 performs intra-prediction in which tests based on multiple intra-prediction modes and transform unit sizes are performed on CUs in an LCU using previously encoded neighboring PUs from the buffer 328 to choose the best intra-prediction mode for each PU in the CU based on a coding cost.

To perform the tests, the intra-prediction component 324 may begin with the CU structure provided by the coding control. The intra-prediction component 324 may divide each CU indicated in the CU structure into PUs according to the unit sizes of the intra-prediction modes and into transform units according to the transform block sizes and calculate the coding costs for each prediction mode and transform block size for each PU. For coding efficiency, the intra-prediction component 324 may also decide to alter the CU structure by further partitioning one or more of the CUs in the CU structure. That is, when choosing the best prediction modes, in addition to testing with the initial CU structure, the intra-prediction component 324 may also chose to divide the larger CUs in the initial CU structure into smaller CUs (within the limits of the recursive quadtree structure), and calculate coding costs at lower levels in the coding hierarchy. If the intra-prediction component 324 changes the initial CU structure, the modified CU structure is communicated to other components that need the information. Further, the coding costs of the intra-predicted PUs and the associated transform block sizes are also provided to the mode decision component 326.

The mode decision component 326 selects between the motion-compensated inter-predicted PUs from the motion compensation component 322 and the intra-predicted PUs from the intra-prediction component 324 based on the coding costs of the PUs and the picture prediction mode provided by the mode selector component. The decision is made at CU level. Based on the decision as to whether a CU is to be intra- or inter-coded, the intra-predicted PUs or inter-predicted PUs are selected, accordingly.

The output of the mode decision component 326, i.e., the predicted PU, is provided to a negative input of the combiner 302 and to a delay component 330. The associated transform block size is also provided to the transform component 304. The output of the delay component 330 is provided to another combiner (i.e., an adder) 338. The combiner 302 subtracts the predicted PU from the current PU to provide a residual PU to the transform component 304. The resulting residual PU is a set of pixel difference values that quantify differences between pixel values of the original PU and the predicted PU. The residual blocks of all the PUs of a CU form a residual CU block for the transform component 304.

The transform component 304 performs block transforms on the residual CU to convert the residual pixel values to transform coefficients and provides the transform coefficients to a quantize component 306. The transform component 304 receives the transform block sizes for the residual CU and applies transforms of the specified sizes to the CU to generate transform coefficients.

The quantize component 306 quantizes the transform coefficients based on quantization parameters (QPs) and quantization matrices provided by the coding control component and the transform sizes. The quantize component 306 may also determine the position of the last non-zero coefficient in a TU according to the scan pattern type for the TU and provide the coordinates of this position to the entropy encoder 334 for inclusion in the encoded bit stream. For example, the quantize component 306 may scan the transform coefficients according to the scan pattern type to perform the quantization, and determine the position of the last non-zero coefficient during the scanning/quantization.

The quantized transform coefficients are taken out of their scan ordering by a scan component 308 and arranged sequentially for entropy coding. The scan component 308 scans the coefficients from the highest frequency position to the lowest frequency position according to the scan pattern type for each TU. In essence, the scan component 308 scans backward through the coefficients of the transform block to serialize the coefficients for entropy coding. As was previously mentioned, a large region of a transform block in the higher frequencies is typically zero. The scan component 308 does not send such large regions of zeros in transform blocks for entropy coding. Rather, the scan component 308 starts with the highest frequency position in the transform block and scans the coefficients backward in highest to lowest frequency order until a coefficient with a non-zero value is located. Once the first coefficient with a non-zero value is located, that coefficient and all remaining coefficient values following the coefficient in the highest to lowest frequency scan order are serialized and passed to the entropy encoder 334. In some embodiments, the scan component 308 may begin scanning at the position of the last non-zero coefficient in the TU as determined by the quantize component 306, rather than at the highest frequency position.

The ordered quantized transform coefficients for a CU provided via the scan component 308 along with header information for the CU are coded by the entropy encoder 334, which provides a compressed bit stream to a video buffer 336 for transmission or storage. The header information may include the prediction mode used for the CU. The entropy encoder 334 also encodes the CU and PU structure of each LCU.

The LCU processing includes an embedded decoder. As any compliant decoder is expected to reconstruct an image from a compressed bit stream, the embedded decoder provides the same utility to the video encoder. Knowledge of the reconstructed input allows the video encoder to transmit the appropriate residual energy to compose subsequent pictures. To determine the reconstructed input, i.e., reference data, the ordered quantized transform coefficients for a CU provided via the scan component 308 are returned to their original post-transform arrangement by an inverse scan component 310, the output of which is provided to a dequantize component 312, which outputs a reconstructed version of the transform result from the transform component 304.

The dequantized transform coefficients are provided to the inverse transform component 314, which outputs estimated residual information which represents a reconstructed version of a residual CU. The inverse transform component 314 receives the transform block size used to generate the transform coefficients and applies inverse transform(s) of the specified size to the transform coefficients to reconstruct the residual values. The inverse transform component 314 may perform techniques for IDCT pruning as described herein.

The reconstructed residual CU is provided to the combiner 338. The combiner 338 adds the delayed selected CU to the reconstructed residual CU to generate an unfiltered reconstructed CU, which becomes part of reconstructed picture information. The reconstructed picture information is provided via a buffer 328 to the intra-prediction component 324 and to an in-loop filter component 316. The in-loop filter component 316 applies various filters to the reconstructed picture information to improve the reference picture used for encoding/decoding of subsequent pictures. The in-loop filter component 316 may, for example, adaptively apply low-pass filters to block boundaries according to the boundary strength to alleviate blocking artifacts causes by the block-based video coding. The filtered reference data is provided to storage component 318.

The encoder efficiency to perform these functions is largely dependent on bit allocation. The encoder 300 allocated bits based on SSIM estimations. Such allocation is described in more detail in FIG. 2.

While the foregoing is directed to embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow. 

What is claimed is:
 1. A method for Structural Similarity Index Matrix (SSIM)-based bit allocation, comprising: encoding a current coding unit in a group of coding units; determining, with one or more processors, a model parameter of a SSIM-based distortion model for the current coding unit, wherein the model parameter depends on characteristics of the coding units; determining, with the one or more processors, a prediction distortion parameter of the current coding unit; and determining, with the one or more processors, a bit allocation for the current coding unit based on the model parameter, the determined prediction distortion parameter of the current coding unit, and a total bit budget for the group of coding units.
 2. The method of claim 1 further comprising determining a bit allocation for each of the coding units in the group of coding units.
 3. The method of claim 2 further comprising determining a target number of bits for each of a plurality of coding units for a next group of coding units.
 4. A non-transitory computer readable medium comprising instructions that, when executed by a processor, cause the processor to: encode a current coding unit in a group of coding units; determine a model parameter of a Structural Similarity Index Matrix (SSIM)-based distortion model for the current coding unit, wherein the model parameter depends on characteristics of the coding units; determine a prediction distortion parameter of the current coding unit; and determine a bit allocation for the current coding unit based on the model parameter, the determined prediction distortion parameter of the current coding unit, and a total bit budget for the group of coding units.
 5. The non-transitory computer readable medium of claim 4, wherein the instructions further cause the processor to determine a target number of bits for each of a plurality of coding units for a next group of coding units.
 6. The non-transitory computer readable medium of claim 4, wherein the instructions further cause the processor to determine a bit allocation for each of the coding units in the group of coding units.
 7. An encoder, comprising: a memory; and a processor coupled to the memory, the processor being configured to determine a model parameter of a Structural Similarity Index Matrix (SSIM)-based distortion model for a current coding unit, determine a prediction distortion parameter of the current coding unit, determine a bit allocation for the current coding unit based on the model parameter, the determined prediction distortion parameter of the current coding unit, and a total bit budget for the group of coding units, wherein the model parameter depends on the characteristics of the current coding units. 